منابع مشابه
On rational definite summation
We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large class of sums (1).
متن کاملOn Floating-Point Summation
In this paper we focus on some general error analysis results in floating-point summation. We emphasize analysis useful from both a scientific and a teaching point of view.
متن کاملFast Ewald summation under 2d- and 1d-periodic boundary conditions based on NFFTs
Ewald summation has established as basic element of fast algorithms evaluating the Coulomb interaction energy of charged particle systems in three dimensions subject to periodic boundary conditions. In this context particle mesh routines, as the P3M method, and the P2NFFT, which is based on nonequispaced fast Fourier transforms (NFFT), should be mentioned. These methods treat the problem effici...
متن کاملThe effect of pupil size on binocular summation at suprathreshold conditions.
PURPOSE To determine the influence of retinal illuminance on monocular or binocular visual reaction time (VRT). METHODS On two normal subjects, uniform circular stimuli were presented with respect to a reference stimulus at the fovea under suprathreshold conditions, and the detection of positive and negative luminance variations was recorded. Binocular and monocular reaction times were measur...
متن کاملNotes on Euler-boole Summation
We study a connection between Euler-MacLaurin Summation and Boole Summation suggested in an AMM note from 1960, which explains them as two cases in a general approach to approximation that also encompasses Taylor sums. Here we give additional details of the construction.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1993
ISSN: 0026-2285
DOI: 10.1307/mmj/1029004679